Generating hierarchial scale-free graphs from fractals

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm Generating Scale Free Graphs

We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature before. The degree statistics of a random graph in our model is governed by the control parameter η stirring the pure exponential statistics for the degree di...

متن کامل

Generating fractals from Voronoi diagrams

This paper describes how to generate fractal patterns by recursively creating Voronoi diagrams on a set of points. These patterns resemble such things as leaf veins and roadmaps. By varying the degree of subdivision and the distribution of points, different output patterns can be obtained.

متن کامل

On Generating Triangle-Free Graphs

We show that the problem to decide whether a graph can be made triangle-free with at most k edge deletions remains NP-complete even when restricted to planar graphs of maximum degree seven. In addition, we provide polynomial-time data reduction rules for this problem and obtain problem kernels consisting of 6k vertices for general graphs and 11k/3 vertices for planar graphs.

متن کامل

Darwini: Generating realistic large-scale social graphs

Synthetic graph generators facilitate research in graph algorithms and processing systems by providing access to data, for instance, graphs resembling social networks, while circumventing privacy and security concerns. Nevertheless, their practical value lies in their ability to capture important metrics of real graphs, such as degree distribution and clustering properties. Graph generators mus...

متن کامل

Hierarchial edge bundles for general graphs

The hierarchical edge bundle method clusters the edges of a radial layout to better understand and analyze graphs, but its effectiveness relies critically on the quality of the hierarchical organization of its nodes and edges. This paper proposes a novel graph visualization approach that extracts the community structure of a network and organizes it into a more balanced and meaningful hierarchy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chaos, Solitons & Fractals

سال: 2011

ISSN: 0960-0779

DOI: 10.1016/j.chaos.2011.05.012